Markov neighborhoods for zero-dimensional basic sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the complexity of computing with zero-dimensional triangular sets

We generalize Kedlaya and Umans’ modular composition algorithm to the multivariate case. As a main application, we give fast algorithms for many operations involving triangular sets (over a finite field), such as modular multiplication, inversion, or change of order. For the first time, we are able to exhibit running times for these operations that are almost linear, without any overhead expone...

متن کامل

Zero-dimensional proximities and zero-dimensional compactifications

Article history: Received 4 August 2008 Received in revised form 12 December 2008 Accepted 13 December 2008 MSC: 54E05 54D35 54G05

متن کامل

Zero sets in pointfree topology and strongly $z$-ideals

In this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. We study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. For strongly z-ideals, we analyze prime ideals using the concept of zero sets. Moreover, it is proven that the intersection of all zero sets of a prime ideal of C(L),...

متن کامل

Three Dimensional Divisorial Extremal Neighborhoods

In this paper we study divisorial extremal neighborhoods C ⊂ Y f −→ X ∋ 0, such that 0 ∈ X is a cAn type threefold terminal singularity, and Γ = f(E) is a smooth curve, where E is the f -exceptional divisor. We view a divisorial extremal neighborhood as a one parameter smoothing of certain surface singularities, and based on this we give a classification of such neighborhoods.

متن کامل

Independent Zero-Knowledge Sets

We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈ S or x / ∈ S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1983

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1983-0709562-2